Densely Connected Pyramid Dehazing Network

نویسندگان

  • He Zhang
  • Vishal M. Patel
چکیده

We propose a new end-to-end single image dehazing method, called Densely Connected Pyramid Dehazing Network (DCPDN), which can jointly learn the transmission map, atmospheric light and dehazing all together. The endto-end learning is achieved by directly embedding the atmospheric scattering model into the network, thereby ensuring that the proposed method strictly follows the physicsdriven scattering model for dehazing. Inspired by the dense network that can maximize the information flow along features from different levels, we propose a new edge-preserving densely connected encoder-decoder structure with multi-level pyramid pooling module for estimating the transmission map. This network is optimized using a newly introduced edge-preserving loss function. To further incorporate the mutual structural information between the estimated transmission map and the dehazed result, we propose a joint-discriminator based on generative adversarial network framework to decide whether the corresponding dehazed image and the estimated transmission map are real or fake. An ablation study is conducted to demonstrate the effectiveness of each module evaluated at both estimated transmission map and dehazed result. Extensive experiments demonstrate that the proposed method achieves significant improvements over the state-of-the-art methods. Code will be made available at: https://github.com/hezhangsprinter

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cascaded Convolutional Neural Network for Single Image Dehazing

Images captured under outdoor scenes usually suffer from low contrast and limited visibility due to suspended atmospheric particles, which directly affects the quality of photos. Despite numerous image dehazing methods have been proposed, effective hazy image restoration remains a challenging problem. Existing learning-based methods usually predict the medium transmission by Convolutional Neura...

متن کامل

Proof that Enhanced Pyramid Networks are 2-Edge-Hamiltonicity

The pyramid network is a hierarchy structure based on meshes. Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network, by replacing each mesh at layer greater than one of the pyramid network with a torus. This investigation demonstrates that the enhanced pyramid network with two faulty edges is Hamiltonian. The result is optimal because both edge connectivity...

متن کامل

End-to-End United Video Dehazing and Detection

The recent development of CNN-based image dehazing has revealed the effectiveness of end-to-end modeling. However, extending the idea to end-to-end video dehazing has not been explored yet. In this paper, we propose an End-to-End Video Dehazing Network (EVD-Net), to exploit the temporal consistency between consecutive video frames. A thorough study has been conducted over a number of structure ...

متن کامل

Hamiltonicity of the Pyramid Network with or without Fault

Sarbazi-Azad, Ould-Khaoua, and Mackenzie proved in 2001 that there exists a Hamiltonian cycle in a pyramid network and they also constructed a Hamiltonian path between apex and each of 4 frontiers of a pyramid network. The fault tolerance is a crucial matter for parallel computing, especially in a large network. This work improves Sarbazi-Azad et al.’s result and considers other relative proble...

متن کامل

The 3*-connected property of pyramid networks

A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k-container if it contains all the vertices of G. A graph G is k-connected if there exists a k-container between any two distinct vertices in G. Let κ(G) be the connectivity of G. A graph G is superconnected if G is i-connected for all 1 ≤ i ≤ κ(G). The pyramid network is one of the i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018